Completely Mitotic r.e. Degrees
نویسندگان
چکیده
An r.e. set A is called mitotic if there exist a pair of disjoint r.e. sets Al, A2 with A, UA, = A (in this case we write AI UA, =A) such that AI =,.A2 sTA. We refer to such a splitting as a mitotic splitting of A. Lachlan [lo] was the first person to show that not all, r.e. sets are mitotic. More extensive investigations into (non)mitoticity were provided by Ladner [ll, 121 who constructed various types of nonmitotic r.e. sets. He also proved the following very interesting theorem: An r.e. set A is mitotic iff A is autoreducible where A is called autoreducible (Trachtenbrot [20]) if there is a functional @ such that, for all x, @(A U {x}; X) = A(x). Following Ladner’s investigations, there have been several other results concerning the existence of nonmitotic r.e. sets. One example is Ingrassia’s [8] result that the degrees containing nonmitotic r.e. sets are dense in R, the r.e. degrees. The interest in Ingrassia’s result is that nonmitotic r.e. sets do not live in all nonzero r.e. degrees. The most difficult of Ladner’s results establishes this. That is, in [12] Ladner constructed a completely mifofic nonzero r.e. degree a, where a is completely mitotic if all of its r.e. elements are mitotic. Our goal in this paper is to investigate the class of completely mitotic degrees. Save for Ladner’s one construction of a low,-low (as P. Cohen observed in [12]) completely mitotic r.e. degree there are no other existence theorems for these degrees. In particular one of the main open questions here was whether or not there exist (even) low nonzero completely mitotic degrees. Ambos-Spies and Fejer [2] have shown that Ladner’s construction cannot be used to answer this, since his construction automatically gives a cont@o~~ r.e. degree (namely an r.e. degree consisting of a single r.e. wtt-degree). In [2] they showed that if a # 0 is low and contiguous then a contains a nonmitotic r.e. set.
منابع مشابه
Weak Density and Cupping in the D-r.e. Degrees
Consider the Turing degrees of di erences of recursively enumerable sets (the d-r.e. degrees). We show that there is a properly d-r.e. degree (a d-r.e. degree that is not r.e.) between any two comparable r.e. degrees, and that given a high r.e. degree h, every nonrecursive d-r.e. degree h cups to h by a low d-r.e. degree. A set A ! is called d-r.e. if there are recursively enumerable (r.e.) set...
متن کاملJoin Irreducibility in the 1 02 Degrees
Let R be a univalent, recursively related system of notations for ordinal α. Lippe [2000a] proves the existence of a 12 degree x, such that for all R, α-r.e. degrees w and all n-REA degrees v, if x ∨w ≥ v, then w ≥ v. Such a degree is said to be join independent for the R, α-r.e. degrees over the n-REA degrees. In this paper, we explore what properties such an x can have. In particular, we show...
متن کاملOn the jumps of the degrees below an r.e. degree∗
A perhaps plausible conjecture about distinguishing among some r.e. degrees based on the jumps of degrees below them would prove the rigidity of the r.e. degrees. We show that the conjecture is false by exhibiting, for every c r.e. in and above 0′, distinct r.e. degrees a and b, each with jump c, such that the classes of the jumps of degrees below a and below b are the same.
متن کاملD.r.e. Degrees and the Nondiamond Theorem
If we study the boolean algebra generated by the recursively enumerable sets we are naturally led to the difference hierarchy of Ershov [6,7,8]. If a set A can be represented as (A1 — A2) U ... U (An_x — An) for r.e. sets An c An_x £ ... £ Ax we say that A is «-r.e. In particular A is r.e. if A is 1-r.e. A set A is called d.r.e. if it is 2-r.e. (so that A = B— C with B and C r.e.). The reader s...
متن کاملThe density of the low2n-r.e. degrees
Although density fails in the d-recursively enumerable (d-r.e.) degrees, and more generally in the n-r.e. degrees (see [3]), we show below that the low 2 n-r.e. degrees are dense. This is achieved by combining density and splitting in the manner of Harrington’s proof (see [9]) for the r.e. (=1r.e.) case. As usual we use low 2 -ness to eliminate infinite outcomes in the construction, with the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 41 شماره
صفحات -
تاریخ انتشار 1989